Spanning and Completeness with Options
نویسنده
چکیده
The role of ordinary options in facilitating the completion of securities markets is examined in the context of a model of contingent claims sufficiently general to accommodate the continuous distributions of asset pricing theory and option pricing theory. In this context, it is shown that call options written on a single security approximately span all contingent claims written on this security and that call options written on portfolios of call options on individual primitive securities approximately span all contingent claims that can be written on these primitive securities. In the case of simple options, explicit formulas are given for the approximating options and portfolios of options. These results are applied to the pricing of contingent claims by arbitrage and to irrelevance propositions in corporate finance.
منابع مشابه
DASTWAR: a tool for completeness estimation in magnitude-size plane
Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...
متن کاملBoundary-Spanning in NIOC’s research projects: Literature meta-synthesis and the direction of future research
The complex and ambiguous nature of innovative activities has forced organizations to think beyond their conventional boundaries. In this regard, inter-organizational projects are carried out with the aim of developing complex technological systems, changing organizational routines and developing capabilities. Designing and implementing inter-organizational projects creates many inter-organizat...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملB -AND B - COMPLETENESS IN LOCALLY CONVEX ALGEBRAS AND THE E x THEOREM
Let E be a B-complete (B -complete) locally convex algebra and $ the topological direct sum of countably many copies of the scalar field with a jointly continuous algebra multiplication. It has been shown that E is also B-complete (B -complete) for componentwise multiplication on E . B-and Br-completeness of E , the unitization of E, and also of E x for other multiplications on E ...
متن کامل